Sharing Decryption in the Context of Voting or Lotteries
نویسندگان
چکیده
Several public key cryptosystems with additional homomor phic properties have been proposed so far They allow to perform com putation with encrypted data without the knowledge of any secret in formation In many applications the ability to perform decryption i e the knowledge of the secret key gives a huge power A classical way to reduce the trust in such a secret owner and consequently to increase the security is to share the secret between many entities in such a way that cooperation between them is necessary to decrypt In this paper we propose a distributed version of the Paillier cryptosystem presented at Eurocrypt This shared scheme can for example be used in an electronic voting scheme or in a lottery where a random number related to the winning ticket has to be jointly chosen by all participants
منابع مشابه
Design and formal verification of DZMBE+
In this paper, a new broadcast encryption scheme is presented based on threshold secret sharing and secure multiparty computation. This scheme is maintained to be dynamic in that a broadcaster can broadcast a message to any of the dynamic groups of users in the system and it is also fair in the sense that no cheater is able to gain an unfair advantage over other users. Another important feature...
متن کاملSecret Sharing Homomorphism and Secure E-voting
Secure E-voting is a challenging protocol.Several approaches based on homomorphic crypto systems, mix-nets blind signatures are proposed in the literature.But most of them need complicated homomorphic encryption which involves complicated encryption decryption process and key management which is not efficient.In this paper we propose a secure and efficient E-voting scheme based on secret sharin...
متن کاملA Social Choice Lemma on Voting Over Lotteries with Applications to a Class of Dynamic Games
We prove a lemma characterizing majority preferences over lotteries on a subset of Euclidean space. Assuming voters have quadratic von NeumannMorgenstern utility representations, and assuming existence of a majority undominated (or “core”) point, the core voter is decisive: one lottery is majority-preferred to another if and only if this is the preference of the core voter. Several applications...
متن کاملA Context-aware Architecture for Mental Model Sharing through Semantic Movement in Intelligent Agents
Recent studies in multi-agent systems are paying increasingly more attention to the paradigm of designing intelligent agents with human inspired concepts. One of the main cognitive concepts driving the core of many recent approaches in multi agent systems is shared mental models. In this paper, we propose an architecture for sharing mental models based on a new concept called semantic movement....
متن کاملDealing with Randomization in Economic Design
Economic design has seen the emergence of a number of attractive randomized rules for allocation, matching, and even voting. In this essay, I would like to raise three fundamental questions in the context of randomization in economic design, which I think have not been sufficiently addressed in the literature. I will take the perspective of social choice theory and refer to randomized collectiv...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2000